- region octree
- региональное октадерево
English-Russian dictionary of mechanical engineering and automation. - RUSSO. B.S. Voskoboinikov, V.L. Mitrovich. 2003.
region octree
Смотреть что такое "region octree" в других словарях:
Octree — Izquierda: Subdivisión recursiva de un cubo en octantes. Derecha: La grilla octree correspondiente. Una grilla octree es una estructura árbol (informática) de datos en la cual cada nodo interno tiene exactamente 8 hijos . Las grillas octree se… … Wikipedia Español
Octree — Left: Recursive subdivision of a cube into octants. Right: The corresponding octree. An octree is a tree data structure in which each internal node has exactly eight children. Octrees are most often used to partition a three dimensional space by… … Wikipedia
Octree — Des nœuds d octree dépeints en tant que division d un espace de couleur. Un octree est une structure de données de type arbre dans laquelle chaque nœud peut compter jusqu à huit enfants. Les octrees sont le plus souvent utilisés pour partitionner … Wikipédia en Français
Октодерево — Слева: Рекурсивное разделение куба на октанты. Справа: Соответствующее октодерево … Википедия
Level set (data structures) — In computer science a level set data structure is designed to represent discretely sampled dynamic level sets functions.A common use of this form of data structure is in efficient image rendering.Chronological developmentsThe powerful level set… … Wikipedia
Quadtree — A quadtree is a tree data structure in which each internal node has up to four children. Quadtrees are most often used to partition a two dimensional space by recursively subdividing it into four quadrants or regions. The regions may be square or … Wikipedia
Potentially visible set — Pour les articles homonymes, voir PVS. Un Potentially Visible Set est une technique utilisée pour accélérer le rendu des environnements en trois dimensions. C est une forme de détermination des surfaces cachées (ou occlusion culling), basée sur… … Wikipédia en Français
Дерево квадрантов — Разбитая с помощью дерева квадрантов плоскость Дерево квадрантов (также квадродерево, 4 дерево, англ. quadtree) дере … Википедия
Binary space partitioning — (BSP) is a method for recursively subdividing a space into convex sets by hyperplanes. This subdivision gives rise to a representation of the scene by means of a tree data structure known as a BSP tree.In simpler words, it is a method of breaking … Wikipedia
Color quantization — An example image in 24 bit RGB color The same image reduced to a palette of 16 colors specifically chosen to best represent the image; the selected palette is shown by the squares above In … Wikipedia
Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… … Wikipedia
